Multi-robot area coverage with limited visibility
نویسندگان
چکیده
We address the problem of multi-robot area coverage and present a new approach in the case where the map of the area and its static obstacles are known and the robots have a limited visibility range. The proposed method starts by locating a set of static guards on the map of the target area and then builds a graph called Reduced-CDT, a new environment representation method based on the Constrained Delaunay Triangulation (CDT). Multi-Prim’s is used to decompose the resultant graph into a forest of partial spanning trees (PSTs). Each PST is modified through a mechanism called Constrained Spanning Tour (CST) to build a cycle which is then assigned to a covering robot. Subsequently, robots start navigating the cycles and consequently cover the whole area. The proposed approach is complete provided that at least one of the robots operates correctly.
منابع مشابه
Fault-Tolerant Multi-Robot Area Coverage with Limited Visibility
We address the problem of multi-robot area coverage and present a new approach in the case where the map of the area and its static obstacles are known and the robots have a limited visibility range. The proposed method starts by locating a set of static guards on the map of the target area and then builds a graph called Reduced-CDT, a new environment representation method based on the Constrai...
متن کاملModels and algorithmic approaches for cooperative multi-robot systems: thesis abstract
The subject of multi-robot systems has been thoroughly investigated in the past decade (e.g., [9, 12, 11, 7]). Current research in multi-robot systems can be divided, roughly, according to two aspects: theoretical robotics (e.g. [12]) and practical robotics (e.g. [10]). Theoretical robotics research, in many cases, make unrealistic assumptions on the robots’ capabilities. For example, robots ar...
متن کاملMulti-Robot Adversarial Coverage
This work discusses the problem of adversarial coverage, in which one or more robots are required to visit every point of a given area, which contains threats that might stop the robots. The objective of the robots is to cover the target area as quickly as possible, while maximizing the percentage of covered area before they are stopped. This problem has many real-world applications, from perfo...
متن کاملHomogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage
Multi-robot area coverage poses several research challenges. The challenge of coordinating multiple robots’ actions coupled with the challenge of minimizing the overlap in coverage across robots becomes even more complex and critical when large teams and large areas are involved. In fact, the efficiency critically hinges on the coordination algorithms used and the robot capabilities. Multi-robo...
متن کاملOn multi-robot area coverage
Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots...
متن کامل